Burning a Graph as a Model of Social Contagion

نویسندگان

  • Anthony Bonato
  • Jeannette C. M. Janssen
  • Elham Roshanbin
چکیده

We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We provide a number of properties of the burning number, including characterizations and bounds. The burning number is computed for several graph classes, and is derived for the graphs generated by the Iterated Local Transitivity model for social networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Burning a graph is hard

We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We provide algorithmic results on the burning number, and prove th...

متن کامل

Can Social Contagion Help Global Health ‘Jump the Shark’?; Comment on “How to Facilitate Social Contagion?”

The instrumental use of social networks has become a central tenet of international health policy and advocacy since the Millennium project. In asking, ‘How to facilitate social contagion?’, Karl Blanchet of the London School of Hygiene and Tropical Medicine therefore reflects not only on the recent success, but also hints to growing challenges; the tactics of partnerships, alliances and platfo...

متن کامل

Burning Number of Graph Products

Graph burning is a deterministic discrete time graph process that can be interpreted as a model for the spread of influence in social networks. The burning number of a graph is the minimum number of steps in a graph burning process for that graph. In this paper, we consider the burning number of graph products. We find some general bounds on the burning number of the Cartesian product and the s...

متن کامل

How to Facilitate Social Contagion?

Achieving the Millennium Development Goals has proven to be a real challenge. Providing evidence on cost-effective interventions did not prove to be sufficient to secure the trust of national authorities, health care providers and patients. Introducing change in a health system requires a good understanding of the relationships between the actors of the system. Social network analysis can provi...

متن کامل

How Complex Contagions Spread Quickly in the Preferential Attachment Model and Other Time-Evolving Networks

In this paper, we study the spreading speed of complex contagions in a social network. A k-complexcontagion starts from a set of initially infected seeds such that any node with at least k infected neighborsgets infected. Simple contagions, i.e., k = 1, quickly spread to the entire network in small world graphs.However, fast spreading of complex contagions appears to be less lik...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014